منابع مشابه
Separation and Weak König's Lemma
We continue the work of [14, 3, 1, 19, 16, 4, 12, 11, 20] investigating the strength of set existence axioms needed for separable Banach space theory. We show that the separation theorem for open convex sets is equivalent to WKL0 over RCA0. We show that the separation theorem for separably closed convex sets is equivalent to ACA0 over RCA0. Our strategy for proving these geometrical Hahn–Banach...
متن کاملWeak Positivity and Dyson’s Lemma
We give a proof of Dyson’s Lemma for a product of smooth projective varieties of arbitrary dimension.
متن کاملOn uniform weak König's lemma
The so-called weak König’s lemma WKL asserts the existence of an infinite path b in any infinite binary tree (given by a representing function f). Based on this principle one can formulate subsystems of higher-order arithmetic which allow to carry out very substantial parts of classical mathematics but are Π2-conservative over primitive recursive arithmetic PRA (and even weaker fragments of ari...
متن کاملGeneralized separation theorems and the Farkas' lemma
The main purpose of this paper is to extend the conventional separation theorems concerning the convex subset of Rm to generalized separation theorems concerning the convex subset of Rm × Sn. This is accomplished by the introduction of the generalized inner product in Rm × Sn. Then we derive the famous Farkas' lemma in nonlinear semidefinite programming, which may be very important for the anal...
متن کاملAnother Unique Weak König’s Lemma Wkl!!
In [2] J. Berger and Ishihara proved, via a circle of informal implications involving countable choice, that Brouwer’s Fan Theorem for detachable bars on the binary fan is equivalent in Bishop’s sense to various principles including a version WKL! of Weak König’s Lemma with a strong effective uniqueness hypothesis. Schwichtenberg [9] proved the equivalence directly and formalized his proof in M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Symbolic Logic
سال: 1999
ISSN: 0022-4812,1943-5886
DOI: 10.2307/2586763